Simple Algorithms for Graph Partition Problems
نویسندگان
چکیده
Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NP-hard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n+m) or O((n+m) log n) time on graphs with n vertices and m edges. For their average case analysis, we consider the planted solution model and prove that they yield an correct answer with high probability for large range of probabilistic parameters.
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملSimplified External Memory Algorithms for Planar DAGs
In recent years a large number I/O-efficient algorithms have been developed for fundamental planar graph problems. Most of these algorithms rely on the existence of small planar separators as well as an O(sort(N)) I/O algorithm for computing a partition of a planar graph based on such separators, where O(sort(N)) is the number of I/Os needed to sort N elements. In this paper we simplify and uni...
متن کاملLex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
By making use of lexicographic breadth rst search (Lex-BFS) and partition re nement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give a O(n + m log n) algorithm for transitive orientation of a comparability graph, and simple linear algorithms to recognize interval graphs, convex graphs, Y -semichordal graphs and matrices that have the consecutiv...
متن کاملNew Graph Partitioning Algorithms 1
Graph partitioning problems are NP-complete and various heuristic algorithms exist in the litterature. Particularly, spectral graph partitioning algorithms partition the graph using the eigenvector associated with the second smallest eigenvalue of the \graph Laplacian." Through the use of graph theory we have devoloped preconditioned subspace algorithms for spectral partitioning.
متن کاملMulti-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
We study the parameterized complexity of a broad class of problems called " local graph partitioning problems " that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique " greediness-for-parameterization " , we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its val...
متن کامل